On cardinality constrained cycle and path polytopes
نویسندگان
چکیده
منابع مشابه
On cardinality constrained cycle and path polytopes
Given a directed graph D = (N, A) and a sequence of positive integers 1 ≤ c1 < c2 < · · · < cm ≤ |N |, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality cp for some p ∈ {1, . . . , m}, respectively. We present integer characterizations of these polytopes by facet defining linear inequalities for which the separation pr...
متن کاملDual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes
We introduce a concept of dual consistency of systems of linear inequalities with full generality. We show that a cardinality constrained polytope is represented by a certain system of linear inequalities if and only if the systems of linear inequalities associated with the cardinalities are dual consistent. Typical dual consistent systems of inequalities are those which describe polymatroids, ...
متن کاملPolyhedral results for the Cardinality Constrained Multi-cycle Problem (CCMcP) and the Cardinality Constrained Cycles and Chains Problem (CCCCP)
In recent years, there has been studies on the cardinality constrained multi-cycle problems on directed graphs, some of which considered chains co-existing on the same digraph whilst others did not. These studies were inspired by the optimal matching of kidneys known as the Kidney Exchange Problem (KEP). In a KEP, a vertex on the digraph represents a donor-patient pair who are related, though t...
متن کاملCardinality Constrained Portfolio Optimisation
The traditional quadratic programming approach to portfolio optimisation is difficult to implement when there are cardinality constraints. Recent approaches to resolving this have used heuristic algorithms to search for points on the cardinality constrained frontier. However, these can be computationally expensive when the practitioner does not know a priori exactly how many assets they may des...
متن کاملOn the cardinality constrained matroid polytope
Given a combinatorial optimization problem Π and an increasing finite sequence c of natural numbers, we obtain a cardinality constrained version Πc of Π by permitting only those feasible solutions of Π whose cardinalities are members of c. We are interested in polyhedra associated with those problems, in particular in inequalities that cut off solutions of forbidden cardinality. Maurras [11] an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2008
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-008-0257-2